A Tableau Calculus for a Nonmonotonic Extension of EL^\mathcal{EL}^\bot
نویسندگان
چکیده
We introduce a tableau calculus for a nonmonotonic extension of low complexity Description Logic EL that can be used to reason about typicality and defeasible properties. The calculus deals with Left Local knowledge bases in the logic EL⊥Tmin recently introduced in [8] . The calculus performs a twophase computation to check whether a query is minimally entailed from the initial knowledge base. It is sound, complete and terminating. Furthermore, it is a decision procedure for Left Local EL⊥Tmin knowledge bases, whose complexity matches the known results for the logic, namely that entailment is in Π 2 .
منابع مشابه
A tableau calculus for a nonmonotonic extension of the Description Logic DL-Litecore
In this paper we introduce a tableau calculus for a nonmonotonic extension of the low complexity Description Logic DL-Litecore of the DL-Lite family. The extension, called DL-LitecTmin, can be used to reason about typicality and defeasible properties. The calculus performs a two-phase computation to check whether a query is minimally entailed from the initial knowledge base. It is sound, comple...
متن کاملNonmonotonic extensions of low-complexity DLs: complexity results and proof methods
In this paper we propose nonmonotonic extensions of low complexity Description Logics EL and DL-Litecore for reasoning about typicality and defeasible properties. The resulting logics are called EL⊥Tmin and DL-LitecTmin. We summarize complexity results for such extensions recently studied. Entailment in DL-LitecTmin is in Π p 2 , whereas entailment in EL ⊥ Tmin is EXPTIMEhard. However, consider...
متن کاملA Nonmonotonic Extension of KLM Preferential Logic P
In this paper, we propose the logic Pmin , which is a nonmonotonic extension of Preferential logic P defined by Kraus, Lehmann and Magidor (KLM). In order to perform nonmonotonic inferences, we define a “minimal model” semantics. Given a modal interpretation of a minimal A-world as A ∧ ¬A, the intuition is that preferred, or minimal models are those that minimize the number of worlds where ¬ ¬A...
متن کاملA Polynomial Time Subsumption Algorithm for Nominal Safe $\mathcal{ELO}_\bot$ under Rational Closure
Description Logics (DLs) under Rational Closure (RC) is a well-known framework for non-monotonic reasoning in DLs. In this paper, we address the concept subsumption decisionproblem under RC for nominal safeELO⊥, a notable and practically important DL represen-tative of the OWL 2 profile OWL 2 EL.Our contribution here is to define a polynomial time subsumption procedure for n...
متن کاملModal Tableaux for Nonmonotonic Reasoning
Artosi and Governatori (1994) and Artosi, Cattabriga and Governatori (1994) presented a tableau-like proof system, called KEM , which has been proven to be able to cope with a wide variety of (normal) modal logics. KEM is based on D’Agostino and Mondadori’s (1994) classical proof system KE, a combination of tableau and natural deduction inference rules which allows for a restricted (“analytic”)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011